Time Restricted Parallel Ray Tracing
نویسندگان
چکیده
Ray tracing is certainly one of the fundamental algorithms in the world of computer graphics. Given enough time, processing power, and highly detailed geometry, the algorithm can produce wonderfully realistic renderings. However, these requirements, especially the first two, can cause a number of headaches for individuals interested in creating renderings. This paper focuses on including the dynamic of time while ray tracing. Time is a restriction on everything in the natural world, and ray tracing is no different. One could forsee many circumstances in which an individual would want to produce an image within a certain duration. Real-time ray tracing for video games or interactive systems is one such use. In a video game situation it is conceivable that gamers may want a rendering system in which they don’t have to set their graphics rendering options to attain a specific frame rate; instead the ray tracer would achieve whatever quality the computer system is capable of. We do not frame our exploration within any sepcific domain; rather, we simply examine the issues raised when guaranteed delivery of a rendering is required by a given time. There are two ways to view the inclusion of a time restriction in a ray tracing scheme. The first is to view the time limitation as a guideline or a goal to achieve over the average case (if rendering multiple frames consecutively). This level of restriction gives more leeway to the algorithm, as it may adapt to the input geometry and spend more time on more complex scenes while spending less on simpler scenes. The second method, and the one which we have adopted for this text, involves setting a hard cap on the time required to ray trace a scene regardless of its complexity. While certainly less general and adaptive than the previously described method, the method is much simpler. Striving for an average framerate introduces questions regarding the tradeoff between saving time for a later run or perfecting the tiniest of shadings on the most insignificant of objects in a scene.
منابع مشابه
An efficient parallel architecture for ray-tracing
Real time rendering of three-dimensional scenes in high photorealistic details is a hard task, such as in the ray tracing rendering algorithm. In general, the performance achieved by a sequential software-based implementation of ray tracing is far from satisfactory. However, parallel implementations of ray tracing have been enabling reasonable real time performance, as the algorithm is embarras...
متن کاملMPIPOV: A Parallel Implementation of POV-Ray Based on MPI
The work presents an MPI parallel implementation of Pov-Ray, a powerful public domain ray tracing engine. The major problem in ray tracing is the large amount of CPU time needed for the elaboration of the image. With this parallel version it is possible to reduce the computation time or to render, with the same elaboration time, more complex or detailed images. The program was tested successful...
متن کاملInteractive-Rate Animation Generation by Parallel Progressive Ray-Tracing on Distributed-Memory Machines
We describe a dynamic load-balancing algorithm for ray-tracing by progressive refinement on a distributed-memory parallel computer. Parallelization of progressive ray-tracing for single images is difficult because of the inherent sequential nature of the sample location generation process, which is optimized (and different) for any given image. Parallelization of progressive ray-tracing when ge...
متن کاملCost Distribution Prediction for Parallel Ray Tracing
Realistic rendering algorithms such as ray tracing are computationally very expensive. The time complexity is determined by a multitude of factors such as image size, geometry, material properties and the quality of the required rendering. This paper presents an algorithm to estimate the cost of ray tracing a scene. Assuming an octree spatial subdivision, the cost per voxel is predicted. For pa...
متن کاملParallel Implementation of Ray Tracing Procedure in Anisotropic Medium
This article describes a parallel implementation of a ray tracing algorithm in a heterogeneous anisotropic geological medium. The shortest path method, which was used for calculations, can give ray path and travel time of seismic wave propagation even for a random and discontinuous velocity field. The high precision required in such calculations was obtained by employing a dense computational g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008